Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty
نویسندگان
چکیده
Long-term heavy maintenance check schedules are crucial in the aviation industry since airlines need them to prepare required tools, workforce, and aircraft spare parts. However, most adopt a manual approach plan current practice. This process relies on experience of their planners, resulting frequent adjustment because uncertainty. paper applies genetic algorithm (GA) generate robust schedules. It aims reduce workload frequency revising considering uncertainties associated with duration daily utilization. A major European airline case study shows that GA finds efficient multi-year for fleet 45 30 min. Compared followed by airline, reduces total number checks 7% while increasing utilization 4.4%, which could potentially lead reduction direct annual costs between $122.5K $612.5K. Furthermore, when testing robustness 4-years produced, Monte Carlo analysis has shown all be maintained before due date 41% episodes simulated, compared 0.27% single deterministic scenario approach.
منابع مشابه
Long Term Cost Effective Preventive Maintenance Scheduling
Preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. It consists of knowing which generating units should be shut down for regular safety inspection. In this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (CRI) is pr...
متن کاملlong term cost effective preventive maintenance scheduling
preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...
متن کاملRobust Optimization for Scheduling under Bounded Uncertainty in Processing Times
A novel robust optimization methodology is proposed for scheduling under bounded uncertainty in processing times. This approach generates “robust” solutions which are in a sense immune against uncertainty when it is applied to Mixed-Integer Linear Programming (MILP) problems with uncertain coefficients and right-hand-side parameters of the inequality constraints. By introducing a small number o...
متن کاملAdvances in Robust Optimization Approaches for Scheduling under Uncertainty
The problem of scheduling under uncertainty is addressed. We propose a novel robust optimization methodology, which when applied to Mixed-Integer Linear Programming (MILP) problems produces “robust” solutions that are, in a sense, immune against uncertainty. The robust optimization approach is applied to the scheduling under uncertainty problem. Based on a novel and effective continuous-time sh...
متن کاملRobust optimization under multiband uncertainty
We provide an overview of the main results that we obtained studying uncertain mixed integer linear programs when the uncertainty is represented through the new multiband model [4]. Such model extends and refines the classical one proposed by Bertsimas and Sim [2] and is particularly suitable in the common case of arbitrary non-symmetric distributions of the uncertainty. Our investigations were...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2022
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2021.105667